Study of Limits of Solvability in Tag Systems
نویسنده
چکیده
In this paper we will give an outline of the proof of the solvability of the halting and reachability problem for 2-symbolic tag systems with a deletion number v = 2. This result will be situated in a more general context of research on limits of solvability in tag systems.
منابع مشابه
Tag systems and Collatz-like functions
Tag systems were invented by Emil Leon Post and proven recursively unsolvable by Marvin Minsky. These production systems have shown very useful in constructing small universal (Turing complete) systems for several different classes of computational systems, including Turing machines, and are thus important instruments for studying limits or boundaries of solvability and unsolvability. Although ...
متن کاملThe Solvability of Concave-Convex Quasilinear Elliptic Systems Involving $p$-Laplacian and Critical Sobolev Exponent
In this work, we study the existence of non-trivial multiple solutions for a class of quasilinear elliptic systems equipped with concave-convex nonlinearities and critical growth terms in bounded domains. By using the variational method, especially Nehari manifold and Palais-Smale condition, we prove the existence and multiplicity results of positive solutions.
متن کاملOn the boundaries of solvability and unsolvability in tag systems. Theoretical and Experimental Results
Several older and more recent results on the boundaries of solvability and unsolvability in tag systems are surveyed. Emphasis will be put on the significance of computer experiments in research on very small tag
متن کاملOn the $c_{0}$-solvability of a class of infinite systems of functional-integral equations
In this paper, an existence result for a class of infinite systems of functional-integral equations in the Banach sequence space $c_{0}$ is established via the well-known Schauder fixed-point theorem together with a criterion of compactness in the space $c_{0}$. Furthermore, we include some remarks to show the vastity of the class of infinite systems which can be covered by our result. The a...
متن کاملSolvability of the Halting and Reachability Problem for Binary 2-tag Systems
In this paper a detailed proof will be given of the solvability of the halting and reachability problem for binary 2-tag systems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007